Recursive models for constructive set theories
نویسندگان
چکیده
منابع مشابه
Presheaf Models for Constructive Set Theories
We introduce a new kind of models for constructive set theories based on categories of presheaves. These models are a counterpart of the presheaf models for intuitionistic set theories defined by Dana Scott in the ’80s. We also show how presheaf models fit into the framework of Algebraic Set Theory and sketch an application to an independence result. 1. Variable sets in foundations and practice...
متن کاملConstructive Set Theories and their Category-theoretic Models
We advocate a pragmatic approach to constructive set theory, using axioms based solely on set-theoretic principles that are directly relevant to (constructive) mathematical practice. Following this approach, we present theories ranging in power from weaker predicative theories to stronger impredicative ones. The theories we consider all have sound and complete classes of category-theoretic mode...
متن کاملRecursive Models of Theories with Few Models
We begin by presenting some basic definitions from effective model theory. A recursive structure is one with a recursive domain and uniformly recursive atomic relations. Without lost of generality, we can always suppose that the domain of every recursive structure is the set of all naturall numbers ω and that its language does not contain function symbols. If a structure A is isomorphic to a re...
متن کاملConstructive Models of Uncountably Categorical Theories
We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a nite language of binary predicates whose only constructive (or recursive) model is the prime model. 0. Introduction. E ective (or recursive) model theory studies to which degree constructions in model theory and algebra can be made e ective. A presentation of a countable model M is an isom...
متن کاملConstructive Induction for Recursive Programs
This paper presents an algorithm for inducing recursive rst order Horn clause programs from examples without background knowledge. This algorithm invents new predicates and their de nitions exhaustively until the instances of a new predicate become the same as examples except for the name of the predicate. Our system CIRP switches into constructive induction mode using a new heuristic taking ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1982
ISSN: 0003-4843
DOI: 10.1016/0003-4843(82)90003-1